/* 
 * Copyright (c) 2009, Giora Kosoi giorak@gmail.com
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name of the project nor the
 *       names of its contributors may be used to endorse or promote products
 *       derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY Giora Kosoi ''AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL Giora Kosoi BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include <sparrow/one_rule_demux.h>
#include <sparrow/reactor.h>
#include <sparrow/variant_headers.h>
#include <sparrow/util.h>
#include <sparrow/errors.h>

OneRuleDemux::OneRuleDemux(Reactor *r, const std::string &config_)
    :   Handler(r),
        unknown_("unknown")
{

    WordVector words;
    parse_words(config_, words);

    if(words.size() % 3 != 0)
    {
        throw_error<std::logic_error>(__FILE__, __LINE__,
                "incorrect number of arguments for OneRuleDemux: config = %s", 
                config_.c_str());
    }

    for(int i = 0; i < words.size(); i += 3)
    {
        rules_.push_back(Rule());
        rules_.back().name = words.at(i);
        rules_.back().value = words.at(i + 1);
        rules_.back().dest = words.at(i + 2);
    }

    register_input(0, this, &OneRuleDemux::input);
}

OneRuleDemux::~OneRuleDemux()
{
}

void OneRuleDemux::input(VariantSet *v)
{
    RuleVector::const_iterator i;
    for(i = rules_.begin(); i != rules_.end(); ++i)
    {
        Variant *val = v->get(i->name, std::nothrow);
        if(val && val->str() == i->value)
        {
            push(i->dest, v);
            break;
        }
    }
    if(i == rules_.end())
    {
        push(unknown_, v);
    }
}

